When and Why Ruppert's Algorithm Works

نویسندگان

  • Gary L. Miller
  • Steven E. Pav
  • Noel Walkington
چکیده

An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph (PSLG) input. The algorithm outputs a Delaunay mesh where no triangle has minimum angle smaller than 26.45◦ except “across” from small angles of the input. No angle of the output mesh is smaller than arctan [(sin θ∗)/(2 − cos θ∗)] where θ∗ is the minimum input angle. Moreover no angle of the mesh is larger than 137.1◦. The adaptive variant is unnecessary when θ∗ is larger than 36.53◦, and thus Ruppert’s Algorithm (with concentric shell splitting) can accept input with minimum angle as small as 36.53◦. An argument is made for why Ruppert’s Algorithm can terminate when the minimum output angle is as large as 30◦.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Where and How Chew's Second Delaunay Refinement Algorithm Works

Chew’s second Delaunay refinement algorithm with offcenter Steiner vertices leads to practical improvement over Ruppert’s algorithm for quality mesh generation, but the most thorough theoretical analysis is known only for Ruppert’s algorithm. A detailed analysis of Chew’s second Delaunay refinement algorithm with offcenters is given, improving the guarantee of well-graded output for any minimum...

متن کامل

Improved Examples of Non-Termination for Ruppert's Algorithm

Improving the best known examples, two planar straight-line graphs which cause the non-termination of Ruppert’s algorithm for a minimum angle threshold as low as α ' 29.06◦ are given.

متن کامل

Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

A b s t r a c t . Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement algorithm for quality mesh generation. Several implementation issues are discussed, including the choice of triangulation algorithms and data structures, the effect of several variants of the Delaunay refinement algorithm on mesh quality, and the use of a...

متن کامل

Why Error Correcting Output Coding Works

Previous research has shown that a technique called error correcting output coding ECOC can dramatically improve the classi cation accuracy of supervised learning algorithms that learn to classify data points into one of k classes This paper presents an empirical investigation of why the ECOC technique works particularly when employed with decision tree learning methods It concludes that an imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003